1 Overlaps among Requirements
نویسندگان
چکیده
Although overlap between specifications – that is the incorporation of elements which designate common features of the domain of discourse – is a prerequisite for specification inconsistency, it has only been a side concern in requirements engineering research. This paper discusses overlap, points out the factors which complicate identification of overlap, and outlines the key components of a programme of research i n this area.
منابع مشابه
A semi-automatic process of identifying overlaps and inconsistencies between requirements specifications
Reconciliation is a method which supports the detection and verification of overlaps and the resolution of certain forms of inconsistencies between requirements specifications expressed in an object-oriented framework. The method identifies a set of candidate overlaps between two specifications by analysing their similarity. These overlaps are assessed by the authors of the specifications. If t...
متن کاملOverlaps among Requirements Specifications
Although overlap between specifications – that is the incorporation of elements which designate common features of the domain of discourse – is a prerequisite for specification inconsistency, it has only been a side concern in requirements engineering research. This paper discusses overlap, points out the complicating factors in its identification an outlines the key components of a programme o...
متن کاملGeneral Properties of Overlap Probability Distributions in Disordered Spin Systems. toward Parisi Ultrametricity
For a very general class of probability distributions in disordered Ising spin systems, in the thermodynamical limit, we prove the following property for overlaps among real replicas. Consider the overlaps among s replicas. Add one replica s + 1. Then, the overlap q as+1 between one of the rst s replicas, let us say a, and the added s + 1 is either independent of the former ones, or it is ident...
متن کاملInit-time Shadow Width Computation through Compile-time Conventions (report Emp Cri A-285)
In compiling stencil-like computations for distributed memory machines a standard technique is to allocate shadow edges to store remote elements from neighbor processors 1]. The eecient management of these edges by HPF compilers at subroutine boundaries is not obvious because the callers do not know the callees' requirements, thus it was proposed to allow their explicit declaration 2]. We prese...
متن کاملEfficient construction of an assembly string graph using the FM-index
MOTIVATION Sequence assembly is a difficult problem whose importance has grown again recently as the cost of sequencing has dramatically dropped. Most new sequence assembly software has started by building a de Bruijn graph, avoiding the overlap-based methods used previously because of the computational cost and complexity of these with very large numbers of short reads. Here, we show how to us...
متن کامل